Santhakumaran, A.P.; Ullas Chandran, S.V.
(Algebra and Discrete Mathematics, 2012)
For vertices u and v in a connected graph G = (V, E), the set ID[u, v] consists of all those vertices lying on a u−v longest path in G. Given a set S of vertices of G, the union of all sets ID[u, v] for u, v ∈ S, is denoted ...